Using Petri Net for Modeling and Analysis of a Encryption Scheme for Wireless Sensor Networks
نویسندگان
چکیده
Nowadays the wireless sensor networks (WSN) are increasingly being required for applications where the data reliability needs to be duly guaranteed. Due to this, many research works have been directed in this sense. However, WSN security is not an entirely solved issue. The aim on this chapter is to use Petri Nets (PN) to model and analyze the validity of an encryption scheme applied to WSN. Usually the modeling of communication systems can become quite complex, most of the time is necessary to consider a large number of variables and mathematical models to describe them. Nevertheless, structural properties of a system and dynamic characteristics of its behavior can not be properly derived from those models. On the other hand, PN can model dynamic characteristics such as synchronization and concurrency. PN were developed by Carl A. Petri in 1962 as a mathematical tool for the study of communication with automata. Its further development was facilitated by the fact that PN can be used to model properties such as process synchronization, concurrent operations, conflicts or resource sharing and deadlock freedom among others (Reisig, 1986), (Reisig & Rozenberg, 1998). In literature we found works where PN have been used in order to model and analyze several related aspects of a WSN. In (Chen et al., 2008) the authors use PN to determine the minimal necessary number of devices in a coal mine, in order to establish the location of miners in case of accident. There are many works related to power constrains, most recently work (Liu, Ren, Lin & Jiang, 2008) deals with the power saving problem, where the authors have proposed four sleeps scheduling schemes for different sorts of and analyze each of them by Stochastic Petri Net (SPN). By using the steady state probability matrix of the SPN models is obtained the average power consumptions and events delays. Also, there are many references devoted to communication protocols and recently in reference (Haines et al., 2007), PN are used as a formal verification technique of a MAC protocol. Where a case study is presented applying this technique to IEEE 802.11 centralised control mechanisms to support delay sensitive streams and fading data traffic. In reference (Pengand et al., 2007) author have used the PN to model the Session Initiation Protocol (SIP) and accomplished its verification.
منابع مشابه
Modeling and Performance Evaluation of Energy Consumption in S-MAC Protocol Using Generalized Stochastic Petri Nets
One of the features of wireless sensor networks is that the nodes in this network have limited power sources. Therefore, assessment of energy consumption in these networks is very important. What has been common practice has been the use of traditional simulators to evaluate the energy consumption of the nodes in these networks. Simulators often have problems such as fluctuating output values i...
متن کاملA Deterministic Multiple Key Space Scheme for Wireless Sensor Networks via Combinatorial Designs
The establishing of a pairwise key between two nodes for encryption in a wireless sensor network is a challenging issue. To do this, we propose a new deterministic key pre-distribution scheme which has modified the multiple key space scheme (MKSS). In the MKSS, the authors define two random parameters to make better resilience than existing schemes. Instead of a random selection of these parame...
متن کاملSecurity Analysis of Lightweight Authentication Scheme with Key Agreement using Wireless Sensor Network for Agricultural Monitoring System
Wireless sensor networks have many applications in the real world and have been developed in various environments. But the limitations of these networks, including the limitations on the energy and processing power of the sensors, have posed many challenges to researchers. One of the major challenges is the security of these networks, and in particular the issue of authentication in the wireles...
متن کاملLPKP: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring
Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...
متن کاملModel Checking Techniques for Verification of an Encryption Scheme for Wireless Sensor Networks
In this paper, we deal with the formal verification of an encryption scheme for Wireless Sensor Networks (WSNs). Especially, we present our first results on building a framework dedicated to modelling and verification of WSNs aspects. To achieve our goal, we propose to specify WSNs models written in Petri nets using Promela constructs in order to verify correctness properties of them using SPIN...
متن کاملA Rssi Based Localization Algorithm for WSN Using a Mobile Anchor Node
Wireless sensor networks attracting a great deal of research interest. Accurate localization of sensor nodes is a strong requirement in a wide area of applications. In recent years, several techniques have been proposed for localization in wireless sensor networks. In this paper we present a localization scheme with using only one mobile anchor station and received signal strength indicator tec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010